const compress/flate.minMatchLength

21 uses

	compress/flate (current package)
		deflate.go#L44: 	minMatchLength  = 4       // The smallest match length that the compressor actually emits
		deflate.go#L125: 	if d.index >= 2*windowSize-(minMatchLength+maxMatchLength) {
		deflate.go#L198: 	loops := (n + 256 - minMatchLength) / 256
		deflate.go#L201: 		end := index + 256 + minMatchLength - 1
		deflate.go#L206: 		dstSize := len(toCheck) - minMatchLength + 1
		deflate.go#L260: 			if n > length && (n > minMatchLength || pos-i <= 4096) {
		deflate.go#L303: 	if len(b) < minMatchLength {
		deflate.go#L308: 	end := len(b) - minMatchLength + 1
		deflate.go#L373: 	d.length = minMatchLength - 1
		deflate.go#L382: 	if d.windowEnd-d.index < minMatchLength+maxMatchLength && !d.sync {
		deflate.go#L386: 	d.maxInsertIndex = d.windowEnd - (minMatchLength - 1)
		deflate.go#L394: 		if lookahead < minMatchLength+maxMatchLength {
		deflate.go#L419: 			hash := hash4(d.window[d.index : d.index+minMatchLength])
		deflate.go#L427: 		d.length = minMatchLength - 1
		deflate.go#L435: 			(d.fastSkipHashing != skipNever && lookahead > minMatchLength-1 ||
		deflate.go#L437: 			if newLength, newOffset, ok := d.findMatch(d.index, d.chainHead-d.hashOffset, minMatchLength-1, lookahead); ok {
		deflate.go#L442: 		if d.fastSkipHashing != skipNever && d.length >= minMatchLength ||
		deflate.go#L443: 			d.fastSkipHashing == skipNever && prevLength >= minMatchLength && d.length <= prevLength {
		deflate.go#L465: 						hash := hash4(d.window[index : index+minMatchLength])
		deflate.go#L478: 					d.length = minMatchLength - 1
		deflate.go#L625: 		d.length = minMatchLength - 1